Stability and Well-Posedness in Linear Semi-Infinite Programming
نویسندگان
چکیده
منابع مشابه
Semi-infinite linear programming approaches to semidefinite programming problems∗
Interior point methods, the traditional methods for the SDP , are fairly limited in the size of problems they can handle. This paper deals with an LP approach to overcome some of these shortcomings. We begin with a semi-infinite linear programming formulation of the SDP and discuss the issue of its discretization in some detail. We further show that a lemma due Pataki on the geometry of the SDP...
متن کاملAn Unconstrained Convex Programming Approach to Linear Semi-Infinite Programming
In this paper, an unconstrained convex programming dual approach for solving a class of linear semi-infinite programming problems is proposed. Both primal and dual convergence results are established under some basic assumptions. Numerical examples are also included to illustrate this approach.
متن کاملStrong duality and sensitivity analysis in semi-infinite linear programming
Finite-dimensional linear programs satisfy strong duality (SD) and have the “dual 8 pricing” (DP) property. The (DP) property ensures that, given a sufficiently small perturbation of 9 the right-hand-side vector, there exists a dual solution that correctly “prices” the perturbation by 10 computing the exact change in the optimal objective function value. These properties may fail in 11 semi-inf...
متن کاملA New Approach for Approximating Solution of Continuous Semi-Infinite Linear Programming
This paper describes a new optimization method for solving continuous semi-infinite linear problems. With regard to the dual properties, the problem is presented as a measure theoretical optimization problem, in which the existence of the solution is guaranteed. Then, on the basis of the atomic measure properties, a computation method was presented for obtaining the near optimal so...
متن کاملVariational Analysis in Semi-Infinite and Infinite Programming, I: Stability of Linear Inequality Systems of Feasible Solutions
This paper concerns applications of advanced techniques of variational analysis and generalized differentiation to parametric problems of semi-infinite and infinite programming, where decision variables run over finite-dimensional and infinite-dimensional spaces, respectively. Part I is primarily devoted to the study of robust Lipschitzian stability of feasible solutions maps for such problems ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Optimization
سال: 1999
ISSN: 1052-6234,1095-7189
DOI: 10.1137/s1052623497319869